Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
231	In Intl. J. of Robotics Research 23(9):, September2004 A formal analysis and taxonomy of task allocation in multi-robot systems Brian P. Gerkey Artificial Intelligence Lab Add to Reading List Source URL: robotics.stanford.edu Language: English - Date: 2004-09-08 19:38:27 Mathematics NP-complete problems Combinatorics Discrete mathematics Operations research Theoretical computer science Combinatorial optimization Greedy algorithm Matroid theory Robotics Robot Assignment problem
232	SYNC or ASYNC: Time to Fuse for Distributed Graph-Parallel Computation Chenning Xie† Rong Chen† Add to Reading List Source URL: ipads.se.sjtu.edu.cn Language: English - Date: 2014-12-16 04:16:53 Graph theory Mathematics Discrete mathematics Graph coloring NP-complete problems Vertex Neighbourhood Distance
233	Lower and Upper Competitive Bounds for Online Directed Graph ExplorationI Klaus-Tycho Foerstera,1,∗, Roger Wattenhofera a ETH Z¨ Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2016-02-08 07:16:33 Graph theory Mathematics Combinatorial optimization Edsger W. Dijkstra Routing algorithms Search algorithms NP-complete problems Graph traversal Shortest path problem Matching A* search algorithm Planar graph
234	Lattice valued identities ˇ selja and A. Tepavˇcevi´c B. Seˇ Blast 2010 Boulder, June 6., 2009. Add to Reading List Source URL: spot.colorado.edu Language: English - Date: 2010-06-06 18:33:12 Algebra Abstract algebra Mathematics Lattice theory Algebraic structures Crystallography Lattice Complete lattice Brillouin zone
235	Distributed Verification and Hardness of Distributed ∗ Approximation Atish Das Sarma † Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:16:16 Graph theory Mathematics Computational complexity theory Spanning tree NP-complete problems Dominating set Minimum spanning tree Maximal independent set Matching Travelling salesman problem Shortest path problem Tree
236	Vaught’s Conjecture and Boolean Algebras Asher M. Kach (Joint with Steffen Lempp) Victoria University of Wellington and University of Connecticut BLAST 2010 Add to Reading List Source URL: spot.colorado.edu Language: English - Date: 2010-06-06 18:33:19 Model theory Boolean algebra Forcing Logic Mathematics Abstraction Complete Boolean algebra Order theory Conjectures Stable theory
237	JMLR: Workshop and Conference Proceedings vol 40:1–33, 2015 Stochastic Block Model and Community Detection in Sparse Graphs: A spectral algorithm with optimal rate of recovery ∗ Peter Chin Add to Reading List Source URL: jmlr.org Language: English - Date: 2015-07-20 20:08:35 Mathematics Graph theory Discrete mathematics NP-complete problems Combinatorics Partition of a set Planar separator theorem Graph coloring
238	Distributed Parallel Inference on Large Factor Graphs Joseph E. Gonzalez Carnegie Mellon University Add to Reading List Source URL: select.cs.cmu.edu Language: English - Date: 2009-08-13 03:47:05 Graphical models NP-complete problems Coding theory Belief propagation Probability theory Factor graph Graph partition Ear decomposition Distributed computing Matching Graph coloring RochaThatte cycle detection algorithm
239	GRADUATE SEMINAR SPRING 2007 PROBLEM SET 1 JONATHAN LETO 1. Problem 1 Show that for ai > 0, pi > 0 p Add to Reading List Source URL: leto.net Language: English - Date: 2007-06-30 02:57:03 Zeta Mathematics Generalized functions Algebraic number theory Complete quotient
240	Seminar: “Geometry&Physics@DFT” Location : DFT Seminar Room (Seminar Homepage) (Indico Page) Date: Monday, October 12, 2015, 12:00 noon Complete integrability of nonlocal nonlinear Schr¨ Add to Reading List Source URL: events.theory.nipne.ro Language: English - Date: 2015-09-29 10:14:20

UPDATE